Control flow graphs and code coverage
نویسندگان
چکیده
منابع مشابه
Control flow graphs and code coverage
The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced gr...
متن کاملGeneration of Control and Data Flow Graphs from Scheduled and Pipelined Assembly Code
High-level synthesis tools generally convert abstract designs described in a high-level language into a control and data flow graph (CDFG), which is then optimized and mapped to hardware. However, there has been little work on generating CDFGs from highly pipelined software binaries, which complicate the problem of determining data flow propagation and dependencies. This paper presents a method...
متن کاملJava Idioms: Code Blocks and Control Flow
For example, polymorphism can in principle be used instead of switch statements [Fowler99]. This can significantly reduce the complexity of the using code because it encapsulates the selection of behavior. However, this comes at a price: for every different case a type needs to be defined. The effort and complexity associated with the creation of types makes this approach inapplicable for suffi...
متن کاملTraces of Control-Flow Graphs
This is a new applied development of trace theory to compilation. Trace theory allows to commute independent program instructions, but overlooks the differences between control and data dependencies. Control(C)-dependences, unlike data-dependences, are determined by the Control Flow Graph, modelled as a local DFA. To ensure semantic equivalence, partial commutation must preserve C-dependences. ...
متن کاملReductions of Control Flow Graphs
Control flow graphs are a well-known representation of the sequential control flow structure of programs with a multitude of applications. Not only single functions but also sets of functions or complete programs can be modeled by control flow graphs. In this case the size of the graphs can grow considerably and thus makes it difficult for software engineers to analyze the control flow. Graph r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematics and Computer Science
سال: 2010
ISSN: 1641-876X
DOI: 10.2478/v10006-010-0056-9